#define  _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<vector>
using namespace std;


//最长递增子序列，差一点想到循环没忍住看了题解
class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        int n = nums.size();

        //创建dp表
        vector<int> dp(n, 1);
        int ret = 1;
        //填表
        for (int i = 1; i < n; i++)
        {
            for (int j = i - 1; j >= 0; j--)
            {
                if (nums[i] > nums[j])  dp[i] = max(dp[i], dp[j] + 1);
            }
            ret = max(ret, dp[i]);

        }


        return ret;
    }
};
int main()
{

	return 0;
}